Infinite separation of quantum information and communication
نویسندگان
چکیده
We prove an infinite separation between quantum information complexity and quantum communication complexity by considering the exclusion game, first introduced by Perry, Jain and Oppenheim [1], who showed that for appropriately chosen parameters of the game, the quantum information cost vanishes as the size of the problem n increases. We extend their result by showing that for those parameters, the quantum communication cost is lower bounded by Ω(log n), thereby proving that there are protocols for which an infinite gap exists between their quantum information and communication costs. We show that this holds not only for zero-error protocols, but also for protocols that have a sufficiently small probability of error.
منابع مشابه
Generated topology on infinite sets by ultrafilters
Let $X$ be an infinite set, equipped with a topology $tau$. In this paper we studied the relationship between $tau$, and ultrafilters on $X$. We can discovered, among other thing, some relations of the Robinson's compactness theorem, continuity and the separation axioms. It is important also, aspects of communication between mathematical concepts.
متن کاملWhen the classical & quantum mechanical considerations hint to a single point; a microscopic particle in a one dimensional box with two infinite walls and a linear potential inside it
In this paper we have solved analytically the Schrödinger equation for a microscopic particle in a one-dimensional box with two infinite walls, which the potential function inside it, has a linear form. Based on the solutions of this special quantum mechanical system, we have shown that as the quantum number approaches infinity the expectation values of microscopic particle position and square ...
متن کاملMulti-Party Quantum Dialogue with the Capability to Expand the Number of Users at Runtime
Quantum dialogue is a type of quantum communication in which users can simultaneously send messages to each other. The earliest instances of quantum dialogue protocols faced security problems such as information leakage and were vulnerable to intercept and resend attacks. Therefore, several protocols have been presented that try to solve these defects. Despite these improvements, the quantum di...
متن کاملDoubly infinite separation of quantum information and communication
Zi-Wen Liu, ∗ Christopher Perry, Yechao Zhu, Dax Enshan Koh, and Scott Aaronson Center for Theoretical Physics and Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, United Kingdom Department of Mathematics, Massachusetts Institute of Technology, Cambridg...
متن کاملCommunication Tasks with Infinite Quantum-Classical Separation.
Quantum resources can be more powerful than classical resources-a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two parties' inputs can be done with exponentially less communication with quantum messages than with classical ones. Here we consider a task between two players, Alice and Bob where quantum resources are infini...
متن کامل